Winner-Takes-All Neural Network Based on 3D NAND Flash With 1-Bit Erase Scheme
نویسندگان
چکیده
3D NAND flash memory constitutes strong competitors for neuromorphic computing due to its high density and mature technology. Neural networks based on differential pair have been reported since conventional block erase scheme hinders individual conductance modulation. However, the halves efficient synaptic operation is still inevitable when one of devices reaches minimum conductance. To overcome these shortcomings, 1-bit was proposed gate induced drain leakage (GIDL) effect. But in this scheme, there are risks unintended erase. In work, gradient bias adopted eliminate potential scheme. Both TCAD simulation experimental results manifest better inhibition Based improved a winner-takes-all neural network constructed, where doubled free from dilemma previous work
منابع مشابه
3D NAND Flash Based on Planar Cells
In this article, the transition from 2D NAND to 3D NAND is first addressed, and the various 3D NAND architectures are compared. The article carries out a comparison of 3D NAND architectures that are based on a “punch-and-plug” process—with gate-all-around (GAA) cell devices—against architectures that are based on planar cell devices. The differences and similarities between the two classes of a...
متن کاملThe winner takes it all.
W e all make mistakes from time to time. I have made my fair share, but none of my mistakes have ever won a prize. In 2002 Lundbeck breached the UK industry code of practice in the way it advertised escitalopram (Cipralex). Escitalopram is the son of citalopram (Cipramil). The company claimed that its new drug, escitalopram was more effective than citalopram, even though the two drugs have exac...
متن کاملRecurrent Neural Network with Soft 'Winner Takes All' Principle for the TSP
This paper shows the application of Wang’s Recurrent Neural Network with the 'Winner Takes All' (WTA) principle in a soft version to solve the Traveling Salesman Problem. In soft WTA principle the winner neuron is updated at each iteration with part of the value of each competing neuron and some comparisons with the hard WTA are made in this work with instances of the TSPLIB (Traveling Salesman...
متن کاملThe winner takes it all
We study competing first passage percolation on graphs generated by the configuration model. At time 0, vertex 1 and vertex 2 are infected with the type 1 and the type 2 infection, respectively, and an uninfected vertex then becomes type 1 (2) infected at rate λ1 (λ2) times the number of edges connecting it to a type 1 (2) infected neighbor. Our main result is that, if the degree distribution i...
متن کاملUnsupervised Feature Learning With Winner-Takes-All Based STDP
We present a novel strategy for unsupervised feature learning in image applications inspired by the Spike-Timing-Dependent-Plasticity (STDP) biological learning rule. We show equivalence between rank order coding Leaky-Integrate-and-Fire neurons and ReLU artificial neurons when applied to non-temporal data. We apply this to images using rank-order coding, which allows us to perform a full netwo...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Electron Device Letters
سال: 2023
ISSN: ['1558-0563', '0741-3106']
DOI: https://doi.org/10.1109/led.2023.3262962